Erratum to: Improved initial vertex ordering for exact maximum clique search
نویسندگان
چکیده
منابع مشابه
Infra-chromatic bound for exact maximum clique search
This paper improves an infra-chromatic bound which is used by the exact branch-andbound maximum clique solver BBMCX (San Segundo et al., 2015) as an upper bound on the clique number for every subproblem. The infra-chromatic bound looks for triplets of colour subsets which cannot contain a 3-clique. As a result, it is tighter than the bound obtained by widely used approximate-colouring algorithm...
متن کاملApproximating the maximum vertex/edge weighted clique using local search
This paper extends the recently introduced Phased Local Search (PLS) algorithm to more difficult maximum clique problems and also adapts the algorithm to handle maximum vertex/edge weighted clique instances. PLS is a stochastic reactive dynamic local search algorithm that interleaves sub-algorithms which alternate between sequences of iterative improvement, during which suitable vertices are ad...
متن کاملAn improved bit parallel exact maximum clique algorithm
This paper describes new improvements for BB-MaxClique [13], a leading maximum clique algorithm which uses bit string data structures to efficiently compute basic operations during search. Improvements include a recently described recoloring strategy in [12], which is now integrated in the bit string framework, as well as different optimization strategies for fast bit scanning. Reported results...
متن کاملRelaxed approximate coloring in exact maximum clique search
This paper presents selective coloring as a new paradigm for branch-and-bound exact maximum clique search. Approximate coloring has, in recent, years been at the heart of leading solvers in the field. Selective coloring proposes to relax coloring up to a certain threshold. The result is a less informed but lighter decision heuristic. Different operators for the remaining uncolored vertices give...
متن کاملA new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search
In this paper we present an exact algorithm for the maximum-weight clique problem on arbitrary undirected graphs. The algorithm based on a fact that vertices from the same independent set couldn’t be included into the same maximum clique. Those independent sets are obtained from a heuristic vertex coloring where each of them is a color class. Color classes and a backtrack search are used for pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Intelligence
سال: 2016
ISSN: 0924-669X,1573-7497
DOI: 10.1007/s10489-016-0862-3